Direct Computation of Operational Matrices for Polynomial Bases
نویسندگان
چکیده
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملOn the Computation of Minimal Polynomial Bases
The problem of determination of a minimal polynomial basis of a rational vector space is the starting point of many control analysis, synthesis and design techniques. In this paper, we propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s). The proposed method exploits the structure of the left null space of generalized W...
متن کاملNumerical Computation of Gröbner Bases for Zero-dimensional Polynomial Ideals
It is well known that in the computation of Gröbner bases an arbitrarily small perturbation in the coefficients of polynomials may lead to a completely different staircase even if the roots of the polynomials change continuously. This phenomenon is called pseudo singularity in this paper. We show how such phenomenon may be detected and even “repaired” by adding a new variable and a binomial rel...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملNumerical Computation of Minimal Polynomial Bases: A Generalized Resultant Approach
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2010
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2010/139198